Complementary Matching Vectors and the Uniform Matching Extension Property
نویسندگان
چکیده
منابع مشابه
Property Matching and Weighted Matching
In many pattern matching applications the text has some properties attached to various of its parts. Pattern Matching with Properties (Property Matching, for short), involves a string matching between the pattern and the text, and the requirement that the text part satisfies some property. Some immediate examples come from molecular biology where it has long been a practice to consider special ...
متن کاملusing fourier based vectors in matching pursuit (mp) algorithm to interpolate seismic data and reconstruct traces on uniform grids
many steps of seismic data processing sequence suppose that data sets are sampled in time and spatial dimensions uniformly. today, this assumption is true but only in time dimension. modern seismic exploration equipment permits seismic data sets to be sampled uniformly and densely in time dimension. however, along spatial dimension uniform and dense sampling are not possible because of operatin...
متن کاملCompressed matching for feature vectors
The problem of compressing a large collection of feature vectors is investigated, so that object identification can be processed on the compressed form of the features. The idea is to perform matching of a query image against an image database, using directly the compressed form of the descriptor vectors, without decompression. Specifically, we concentrate on the Scale Invariant Feature Transfo...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملFaster index for property matching
In this paper, we revisit the Property Matching problem studied by Amir et al. [Property Matching and Weighted Matching, CPM 2006] and present a better indexing scheme for the problem. In particular, the data structure by Amir et al., namely PST, requires O(n log |Σ|+ n log log n) construction time and O(m log |Σ|+ K) query time, where n and m are the length of, respectively, the text and the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1981
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(81)80025-x